An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
نویسندگان
چکیده
We prove lower bounds of the form exp (n " d) ; " d > 0; on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth d; for any constant d: This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known.
منابع مشابه
Matrix identities and the pigeonhole principle
We show that short bounded-depth Frege proofs of matrix identities, such as PQ = I ⊃ QP = I (over the field of two elements), imply short bounded-depth Frege proofs of the pigeonhole principle. Since the latter principle is known to require exponential-size bounded-depth Frege proofs, it follows that the propositional version of the matrix principle also requires bounded-depth Frege proofs of e...
متن کاملAn Exponential Separation between the Matching Principleand
The combinatorial matching principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a xed bi-partition of the vertices, there is no perfect matching between them. Therefore , it follows from recent lower bounds for the pigeonhole principle that the matching principle requires exponential-size boun...
متن کاملAn Exponential Separation between the Parity Principle andthe
The combinatorial parity principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a xed bi-partition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the parity principle requires exponential-size bounded-d...
متن کاملAn Exponential Separation Between the Parity Principle and the Pigeonhole Principle
The combinatorial parity principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a fixed bipartition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the parity principle requires exponentialsize bounded-d...
متن کاملBounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m 1 1 polylog n n. This lower bound qualitatively matches the known quasi-polynomial-size bounded-depth Frege proofs for these principles. Our technique, which uses a switching lemma argument like other lower bounds for boundeddepth Frege proofs, is novel in that the tautol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 1 شماره
صفحات -
تاریخ انتشار 1994